Privacy Preservation in I-voting Using Homomorphic Technology
نویسنده
چکیده
Voting is one of the most important activities in a democratic society. In a usual voting environment voting process sometimes becomes quite difficult due to the unwillingness of certain voters to visit a polling booth to cast votes besides involving huge social and human resources. The advance of computer networks and security techniques help the implementation of electronic voting. I-voting protocol is based on Homomorphic Technology and guarantees eligibility, unreusability, privacy, verifiability and also receipt-freeness and uncoercibility. The scheme can be implemented in a practical environment, since it does not use voting booth or untappable channel, only public channels are applied. The proposed protocol encompasses three distinct phases that of registration phase, voting phase and counting phase involving five parties, the voter, certification centre, authentication server, voting server and a tallying server.
منابع مشابه
Secure E-voting Using Homomorphic Technology
Voting is one of the most important activities in a democratic society. In a traditional voting environment voting process sometimes becomes quite inconvenient due to the reluctance of certain voters to visit a polling booth to cast votes besides involving huge social and human resources. The development of computer networks and elaboration of cryptographic techniques facilitate the implementat...
متن کاملPreservation of Privacy for Multiparty Computation System with Homomorphic Encryption
Data mining is the task of discovering significant patterns/rules/results from a set of large amount of data stored in databases, data warehouse or in other information repositories. Even though the focus on datamining technology has been on the discovery of general patterns some data-mining applications may require to access individual’s records having sensitive privacy data. Abundance of reco...
متن کاملEfficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting
Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash funct...
متن کاملDesign and Implementation of Secure Remote e-Voting System Using Homomorphic Encryption
Internet polling also known as “e-voting” became popular in past few years, since it reduces the tallying cost and time, increases the number of voter participation, also reduces the human resources and the traditional work that means less fraud and corruption. In this paper, a remote e-Voting system is designed and implemented using homomorphic encryption. The homomorphic property in ElGamal c...
متن کاملVoting with unconditionally privacy: CFSY for booth voting
In this note we simplify the Cramer, Franklin, Schoenmaker and Yung internet voting protocol to the booth setting. In it, objects of the form g 0g x1 1 · · · g xl l (mod q) are used to define an unconditionally hiding commitment scheme. Because of their homomorphic properties they are particularly suited for voting protocols with unconditional privacy. In fact, we show that almost all existing ...
متن کامل